A Bernstein-type Inequality for Suprema of Random Processes with Applications to Model Selection in Non-gaussian Regression

نویسنده

  • YANNICK BARAUD
چکیده

Let (Xt)t∈T be a family of real-valued centered random variables indexed by a countable set T . In the first part of this paper, we establish exponential bounds for the deviation probabilities of the supremum Z = supt∈T Xt by using the generic chaining device introduced in Talagrand (1995). Compared to concentration-type inequalities, these bounds offer the advantage to hold under weaker conditions on the family (Xt)t∈T . The second part of the paper is oriented towards statistics. We consider the regression setting Y = f + ξ where f is an unknown vector of Rn and ξ is a random vector the components of which are independent, centered and admit finite Laplace transforms in a neighborhood of 0. Our aim is to estimate f from the observation of Y by mean of a model selection approach among a collection of linear subspaces of Rn. The selection procedure we propose is based on the minimization of a penalized criterion the penalty of which is calibrated by using the deviation bounds established in the first part of this paper. More precisely, we study suprema of random variables of the form Xt = Pn i=1 tiξi when t varies among the unit ball of a linear subspace of Rn. We finally show that our estimator satisfies some oracle-type inequality under suitable assumptions on the metric structures of the linear spaces of the collection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bernstein-type Inequality for Suprema of Random Processes with an Application to Statistics

We use the generic chaining device proposed by Talagrand to establish exponential bounds on the deviation probability of some suprema of random processes. Then, given a random vector ξ in R the components of which are independent and admit a suitable exponential moment, we deduce a deviation inequality for the squared Euclidean norm of the projection of ξ onto a linear subspace of R. Finally, w...

متن کامل

Some applications of the Malliavin calculus to sub-Gaussian and non-sub-Gaussian random elds

We introduce a boundedness condition on the Malliavin derivative of a random variable to study subGaussian and other non-Gaussian properties of functionals of random …elds, with particular attention to the estimation of suprema. We relate the boundedness of nth Malliavin derivatives to a new class of “sub-nth Gaussian chaos” processes. An expected supremum estimation, extending the DudleyFerniq...

متن کامل

Supremum Concentration Inequality and Modulus of Continuity for Sub-nth Chaos Processes

This article provides a detailed analysis of the behavior of suprema and moduli of continuity for a large class of random fields which generalize Gaussian processes, sub-Gaussian processes, and random fields that are in the nth chaos of a Wiener process. An upper bound of Dudley type on the tail of the random field’s supremum is derived using a generic chaining argument; it implies similar resu...

متن کامل

A Bernstein-type inequality for stochastic processes of quadratic forms of Gaussian variables

The concentration phenomenon of stochastic processes around their mean is of key importance in statistical estimation by model selection for getting nonasymptotic bounds for some statistics. For example in model selection via penalization, for devising sharp penalties and proving useful upper bounds for the risk of an estimator, one needs generally to control uniformly the statistic of the risk...

متن کامل

On Gaussian comparison inequality and its application to spectral analysis of large random matrices

Recently, Chernozhukov, Chetverikov, and Kato [Ann. Statist. 42 (2014) 1564–1597] developed a new Gaussian comparison inequality for approximating the suprema of empirical processes. This paper exploits this technique to devise sharp inference on spectra of large random matrices. In particular, we show that two long-standing problems in random matrix theory can be solved: (i) simple bootstrap i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009